Graph Operations on Clique-Width Bounded Graphs
نویسنده
چکیده
In this paper we survey the behavior of various graph operations on the graph parameters clique-width and NLC-width. We give upper and lower bounds for the clique-width and NLC-width of the modi ed graphs in terms of the clique-width and NLC-width of the involved graphs. Therefor we consider the binary graph operations join, co-join, sum, di erence, products, corona, substitution, and 1-sum, and the unary graph operations quotient, subgraph, edge complement, bipartite edge complement, power of graphs, switching, local complementation, edge addition, edge subdivision, vertex identi cation, and vertex addition.
منابع مشابه
Upper bounds to the clique width of graphs
A graph complexity measure that we call clique-width is associated in a natural way with certain graph decompositions, more or less like tree-width is associated with tree-decomposition which are, actually, hierarchical decompositions of graphs. In general, a decomposition of a graph G can be viewed as a nite term, written with appropriate operations on graphs, that evaluates to G. Innnitely ma...
متن کاملOn the Clique-Width of Perfect Graph Classes
Graphs of clique–width at most k were introduced by Courcelle, Engelfriet and Rozenberg (1993) as graphs which can be defined by k-expressions based on graph operations which use k vertex labels. In this paper we study the clique–width of perfect graph classes. On one hand, we show that every distance–hereditary graph, has clique– width at most 3, and a 3–expression defining it can be obtained ...
متن کاملPolynomial-time Algorithm for Isomorphism of Graphs with Clique-width at most 3
The clique-width is a measure of complexity of decomposing graphs into certain tree-like structures. The class of graphs with bounded clique-width contains bounded tree-width graphs. While there are many results on the graph isomorphism problem for bounded treewidth graphs, very little is known about isomorphism of bounded cliquewidth graphs. We give the first polynomial-time graph isomorphism ...
متن کاملA comparison of two approaches for polynomial time algorithms computing basic graph parameters
In this paper we compare and illustrate the algorithmic use of graphs of bounded treewidth and graphs of bounded clique-width. For this purpose we give polynomial time algorithms for computing the four basic graph parameters independence number, clique number, chromatic number, and clique covering number on a given tree structure of graphs of bounded tree-width and graphs of bounded clique-widt...
متن کاملClique-width and tree-width of sparse graphs
Tree-width and clique-width are two important graph complexity measures that serve as parameters in many fixed-parameter tractable (FPT) algorithms. The same classes of sparse graphs, in particular of planar graphs and of graphs of bounded degree have bounded tree-width and bounded clique-width. We prove that, for sparse graphs, clique-width is polynomially bounded in terms of tree-width. For p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/cs/0701185 شماره
صفحات -
تاریخ انتشار 2007